翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Cichon's diagram : ウィキペディア英語版
Cichoń's diagram
In set theory,
Cichoń's diagram or Cichon's diagram is a table of 10 infinite cardinal numbers related to the set theory of the reals displaying the provable relations between these
cardinal characteristics of the continuum. All these cardinals are greater than or equal to \aleph_1, the smallest uncountable cardinal, and they are bounded above by 2^, the cardinality of the continuum. Four cardinals describe properties of the ideal of sets of measure zero; four more describe the corresponding properties of the ideal of meager sets (first category sets).
==Definitions==

Let ''I'' be an ideal of a fixed infinite set ''X'', containing all finite subsets of ''X''. We define the following "cardinal coefficients" of ''I'':
*(I)=\min\\subseteq I \wedge \bigcup\notin I\big\}.
::The "additivity" of ''I'' is the smallest number of sets from ''I'' whose union is not in ''I'' any more. As any ideal is closed under finite unions, this number is always at least \aleph_0; if ''I'' is a σ-ideal, then add(''I'')≥\aleph_1.
*(I)=\min\\subseteq I \wedge\bigcup=X\big\}.
:: The "covering number" of ''I'' is the smallest number of sets from ''I'' whose union is all of ''X''. As ''X'' itself is not in ''I'', we must have add(''I'') ≤ cov(''I'').
*(I)=\min\,
:: The "uniformity number" of ''I'' (sometimes also written (I)) is the size of the smallest set not in ''I''. By our assumption on ''I'', add(''I'') ≤ non(''I'').
*(I)=\min\\subseteq I \wedge (\forall A\in I)(\exists B\in )(A\subseteq B)\big\}.
:: The "cofinality" of ''I'' is the cofinality of the partial order (''I'', ⊆). It is easy to see that we must have non(''I'') ≤ cof(''I'') and cov(''I'') ≤ cof(''I'').
Furthermore, the "bounding number" or "unboundedness number" and the "dominating number" are defined as follows:
*=\min\big\\ \wedge\ (\forall g\in ^)(\exists f\in F)(\exists^\infty n\in)(g(n),
*=\min\big\\ \wedge\ (\forall g\in^)(\exists f\in F)(\forall^\infty n\in)(g(n),
where "\exists^\infty n\in" means: "there are infinitely many natural numbers ''n'' such that...", and "\forall^\infty n\in" means "for all except finitely many natural numbers ''n'' we have...".

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Cichoń's diagram」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.